# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def longestCommonPrefix(self, strs: List[str]) -> str:
        ans = ''
        str = strs[0]

        for i in range(0, len(str)):
            char = str[i]
            for j in range(1, len(strs)):
                sub_str = strs[j]
                if i >= len(sub_str) or char != sub_str[i]:
                    return ans

            ans += char

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (["flower","flow","flight"], 'fl'),
        (["dog","racecar","car"], '')
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.longestCommonPrefix(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

